Parallel Acceleration Scheme for Monte Carlo Based SSTA Using Generalized STA Processing Element
نویسندگان
چکیده
منابع مشابه
Parallel Acceleration Scheme for Monte Carlo Based SSTA Using Generalized STA Processing Element
We propose a novel acceleration scheme for Monte Carlo based statistical static timing analysis (MC-SSTA). MC-SSTA, which repeatedly executes ordinary STA using a set of randomly generated gate delay samples, is widely accepted as an accuracy reference. A large number of random samples, however, should be processed to obtain accurate delay distributions, and software implementation of MC-SSTA, ...
متن کاملParallel Monte Carlo Sampling Scheme for Sphere and Hemisphere
The sampling of certain solid angle is a fundamental operation in realistic image synthesis, where the rendering equation describing the light propagation in closed domains is solved. Monte Carlo methods for solving the rendering equation use sampling of the solid angle subtended by unit hemisphere or unit sphere in order to perform the numerical integration of the rendering equation. In this w...
متن کاملSpatial-partitioning-based Acceleration for Variational Monte Carlo
The problem of inherently differing time scales of core and valence electrons in Monte Carlo (MC) simulations is circumvented in a straightforward and intuitive manner. By appropriately subdividing into equivalent subspaces the high-dimensional (manyelectron) space in which Monte Carlo integration is done, it is possible to choose completely independent and appropriate sampling times for each “...
متن کاملGeneralized darting Monte Carlo
One of the main shortcomings of Markov chain Monte Carlo samplers is their inability to mix between modes of the target distribution. In this paper we show that advance knowledge of the location of these modes can be incorporated into the MCMC sampler by introducing mode-hopping moves that satisfy detailed balance. The proposed sampling algorithm explores local mode structure through local MCMC...
متن کاملGeneralized Hybrid Monte Carlo
One of the most demanding calculations is to generate random samples from a specified probability distribution (usually with an unknown normalizing prefactor) in a high-dimensional configuration space. One often has to resort to using a Markov chain Monte Carlo method, which converges only in the limit to the prescribed distribution. Such methods typically inch through configuration space step ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Electronics
سال: 2013
ISSN: 0916-8524,1745-1353
DOI: 10.1587/transele.e96.c.473